Browsing by Subject "Iterative algorithm"
Now showing items 1-15 of 15
-
Article
Clustering attributed multi-graphs with information ranking
(2015)Attributed multi-graphs are data structures to model realworld networks of objects which have rich properties/attributes and they are connected by multiple types of edges. Clustering attributed multigraphs has several ...
-
Conference Object
Control of distributed energy resources for reactive power support
(2011)This paper proposes a method to utilize distributed energy resources (DERs) to provide reactive power support for voltage control in electric power systems. Rather than controlling each of these resources directly, a ...
-
Conference Object
Decentralized optimal dispatch of distributed energy resources
(2012)In this paper, we address the problem of optimally dispatching a set of distributed energy resources (DERs) without relying on a centralized decision maker. We consider a scenario where each DER can provide a certain ...
-
Conference Object
Distributed algorithms for control of demand response and distributed energy resources
(2011)This paper proposes distributed algorithms for control and coordination of loads and distributed energy resources (DERs) in distribution networks. These algorithms are relevant for load curtailment control in demand response ...
-
Conference Object
Distributed balancing of a digraph with integer weights
(Institute of Electrical and Electronics Engineers Inc., 2013)We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...
-
Article
Distributed Balancing of Commodity Networks Under Flow Interval Constraints
(2018)We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
-
Conference Object
Distributed balancing under interval flow constraints in directed communication topologies
(Institute of Electrical and Electronics Engineers Inc., 2018)In this paper, we propose a distributed algorithm that relies on a strongly connected (but possibly directed) communication topology to achieve admissible and balanced flows in a given network. More specifically, we consider ...
-
Article
A distributed generation control architecture for islanded ac microgrids
(2015)In this paper, we propose a distributed architecture for generation control in islanded ac microgrids with both synchronous generators and inverter-interfaced power supplies. Although they are smaller and have lower ratings, ...
-
Article
Distributed matrix scaling and application to average consensus in directed graphs
(2013)We propose a class of distributed iterative algorithms that enable the asymptotic scaling of a primitive column stochastic matrix, with a given sparsity structure, to a doubly stochastic form. We also demonstrate the ...
-
Article
Distributed resource coordination in networked systems described by digraphs
(2015)We consider a multicomponent system in which each component can receive/transmit information from/to components in its immediate neighborhood. Communication links between components are not required to be bidirectional, ...
-
Article
Distributed stopping for average consensus in undirected graphs via event-triggered strategies
(2016)We develop and analyze two distributed event-triggered linear iterative algorithms that enable the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...
-
Conference Object
Distributed stopping in average consensus via event-triggered strategies
(IEEE Computer Society, 2013)We develop and analyze a distributed event-triggered linear iterative algorithm that enables the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...
-
Conference Object
Distributed strategies for balancing a weighted digraph
(2012)A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
-
Conference Object
Distributed weight balancing under integer constraints in the presence of packet drops
(Institute of Electrical and Electronics Engineers Inc., 2018)A digraph with positive integer weights on its (directed) edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. We develop a distributed ...
-
Conference Object
Finite-time approximate consensus and its application to distributed frequency regulation in islanded AC microgrids
(IEEE Computer Society, 2015)In this paper, we propose an iterative algorithm that allows a set of interconnected nodes to reach approximate consensus in a finite number of steps, i.e., Allows the nodes to reach agreement to within a pre-specified ...